Scheduling with a due-window for acceptable lead-times

نویسندگان

  • Enrique Gerstl
  • Gur Mosheiov
چکیده

Due-dates are often determined during sales negotiations between customers and the sales team of the firm. In the preliminary (pre-sale) stage, the customer provides a time interval (due-window) of his preferred due-dates. This interval reflects acceptable leadtimes, which are functions of the customer resource constraints (e.g. storage or personnel limitations). If the due-dates are assigned either prior to or after the due-window, the firm is penalized accordingly. The final contract refers to the penalties of the actual delivery times as well. Thus, for given (realized) due-dates, the firm is also penalized according to the earliness/tardiness of the delivery time of the products. The model introduced in this paper considers both parts of the sales negotiations (i.e., determination of the time interval for acceptable due-dates, and earliness/tardiness penalties of the actual delivery times). Scheduling literature contains three major procedures for assigning due-dates to jobs: ( ) assigning a common due-date for all the jobs (also known as CON), ( ) assigning jobdependent due-dates which are (linear) functions of the job processing times (also known as SLK), and ( ) assigning job-dependent due-dates which are penalized if exceed prespecified deadlines (also known as DIF). One extension of these models is to a setting of due-window. In this setting, jobs completed within a time interval (rather than at a time point) are not penalized. Jobs completed prior to or after this time interval (window) are penalized according to their earliness/tardiness. The extensions of CON to a setting of common due-window (also known as CONW), and that of SLK to a due-window (SLKW) have been solved and published. The extension of DIF to a due-window is presented in this paper. ISS & MLB―September 24-26, 2013

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Goal programming-based post-disaster decision making for allocation and scheduling the rescue units in natural disaster with time-window

Natural disasters, such as earthquakes, tsunamis, and hurricanes cause enormous harm during each year. To reduce casualties and economic losses in the response phase, rescue units must be allocated and scheduled efficiently, such that it is a key issues in emergency response. In this paper, a multi-objective mix integer nonlinear programming model (MOMINLP) is proposed to minimize sum of weight...

متن کامل

A fuzzy multi-objective linear programming approach for solving a new multi-objective job shop scheduling with sequence-dependent setup times

This paper presents a new mathematical model for a bi-objective job shop scheduling problem with sequence-dependent setup times that minimizes the weighted mean completion time and the weighted mean tardiness time. For solving this multi-objective model, we develop a fuzzy multi-objective linear programming (FMOLP) model. In this problem, a proposed FMOLP method is applied with respect to the o...

متن کامل

A New Multi-objective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm

This paper  presents a new multi objective job shop scheduling with sequence-dependent setup times. The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. A mixed integer programming model is developed for the given problem that belongs to NP-hard class. In this case, traditional approaches cannot reach to an optimal solution in a reasonable...

متن کامل

SINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT

In this paper, a due date assignment scheduling problem with precedence constraints and controllable processing times in uncertain environment is investigated, in which the basic processing time of each job is assumed to be the symmetric trapezoidal fuzzy number, and the linear resource consumption function is used.The objective is to minimize the crisp possibilistic mean (or expected) value of...

متن کامل

A fuzzy mixed-integer goal programming model for a parallel machine scheduling problem with sequence-dependent setup times and release dates

This paper presents a new mixed-integer goal programming (MIGP) model for a parallel machine scheduling problem with sequence-dependent setup times and release dates. Two objectives are considered in the model to minimize the total weighted flow time and the total weighted tardiness simultaneously. Due to the com-plexity of the above model and uncertainty involved in real-world scheduling probl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JORS

دوره 66  شماره 

صفحات  -

تاریخ انتشار 2015